A Parametric Propagator for Discretely Convex Pairs of Sum Constraints
نویسندگان
چکیده
We introduce a propagator for abstract pairs of Sum constraints, where the expressions in the sums respect a form of convexity. This propagator is parametric and can be instantiated for various concrete pairs, including Deviation, Spread, and the conjunction of Sum and Count. We show that despite its generality, our propagator is competitive in theory and practice with state-of-the-art propagators.
منابع مشابه
A parametric propagator for pairs of Sum constraints with a discrete convexity property
We introduce a propagator for pairs of Sum constraints, where the expressions in the sums respect a form of convexity. This propagator is parametric and can be instantiated for various concrete pairs, including Deviation, Spread, and the conjunction of Linear≤ and Among. We show that despite its generality, our propagator is competitive in theory and practice with state-of-the-art propagators.
متن کاملAn efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming
This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequencydivision multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus...
متن کاملAn Efficient Algorithm for Weighted Sum-Rate Maximization in Multicell OFDMA Downlink
This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequencydivision multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملSum-Rate Maximization Based on Power Constraints for Cooperative AF Relay Networks
In this paper, our objective is maximizing total sum-rate subject to power constraints on total relay transmit power or individual relay powers, for amplify-and-forward single-antenna relay-based wireless communication networks. We derive a closed-form solution for the total power constraint optimization problem and show that the individual relay power constraints optimization problem is a quad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013